Deadline scheduling and power management for speed bounded processors
نویسندگان
چکیده
منابع مشابه
Deadline scheduling and power management for speed bounded processors
Energy consumption has become an important issue in the study of processor scheduling. Energy reduction can be achieved by allowing a processor to vary the speed dynamically (dynamic speed scaling) [2–4, 7, 10] or to enter a sleep state [1, 5, 8]. In the past, these two mechanisms are often studied separately. It is indeed natural to consider an integrated model in which a processor, when awake...
متن کاملScheduling for Speed Bounded Processors
We consider online scheduling algorithms in the dynamic speed scaling model, where a processor can scale its speed between 0 and some maximum speed T . The processor uses energy at rate s when run at speed s, where α > 1 is a constant. Most modern processors use dynamic speed scaling to manage their energy usage. This leads to the problem of designing execution strategies that are both energy e...
متن کاملOnline Deadline Scheduling with Bounded Energy Efficiency
Existing work on scheduling with energy concern has focused on minimizing the energy for completing all jobs or achieving maximum throughput [19, 2, 7, 13, 14]. That is, energy usage is a secondary concern when compared to throughput and the schedules targeted may be very poor in energy efficiency. In this paper, we attempt to put energy efficiency as the primary concern and study how to maximi...
متن کاملHigh Speed Low Power Network Processors: Efficient Power Management Techniques
Power consumption is the bottleneck in achieving high performance. Power dissipation needs to be looked into the various levels of the design namely: circuit level, device level, architecture level and system level. With the increase in the networking, network processors (NP) have emerged as platform providing high performance and flexible in building the routers. Its observed from the survey o...
متن کاملNon-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors
We consider the online scheduling problem of minimizing total weighted flow time plus energy on a processor that can scale its speed dynamically between 0 and some maximum speed T . In the past few years this problem has been studied extensively under the clairvoyant setting, which requires the size of a job to be known when it is released [1, 4, 5, 8, 12, 15, 16, 17]. For the non-clairvoyant s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.05.035